Sequent calculi for bi-intuitionistic propositional logic
نویسندگان
چکیده
Bi-intuitionistic logic is the conservative extension of intuitionistic logic with a connective dual to implication. It is sometimes presented as a symmetric constructive subsystem of classical logic. In this talk, we compare three sequent calculi for bi-intuitionistic propositional logic: (1) a basic standard-style sequent calculus that restricts the premises of implication-right and exclusion-left inferences to be singleconclusion resp. single-assumption and is incomplete without the cut rule, (2) the calculus with nested sequents by Goré et al., where a complete class of cuts is encapsulated into special “unnest” rules and (3) a cut-free labelled sequent calculus derived from the Kripke semantics of the logic. We show that these calculi can be translated into each other and discuss the ineliminable cuts of the standard-style sequent calculus.
منابع مشابه
Relating Sequent Calculi for Bi-intuitionistic Propositional Logic
Bi-intuitionistic logic is the conservative extension of intuitionistic logic with a connective dual to implication. It is sometimes presented as a symmetric constructive subsystem of classical logic. In this paper, we compare three sequent calculi for bi-intuitionistic propositional logic: (1) a basic standard-style sequent calculus that restricts the premises of implication-right and exclusio...
متن کاملProof Search and Counter-Model Construction for Bi-intuitionistic Propositional Logic with Labelled Sequents
Bi-intuitionistic logic is a conservative extension of intuitionistic logic with a connective dual to implication, called exclusion. We present a sound and complete cut-free labelled sequent calculus for bi-intuitionistic propositional logic, BiInt, following S. Negri’s general method for devising sequent calculi for normal modal logics. Although it arises as a natural formalization of the Krip...
متن کاملProof Search and Countermodel Construction in Bi-intuitionistic Propositional Logic
Bi-intuitionistic propositional logic (also known as Heyting-Brouwer logic, subtractive logic) extends intuitionistic propositional logic with a connective that is dual to implication, called coimplication. It is the logic of bi-[Cartesian closed] categories and it also has a Kripke semantics. It first got the attention of C. Rauszer who studied it in a number of papers. Later, it has been inve...
متن کاملThe Inverse Method for the Logic of Bunched Implications
The inverse method, due to Maslov, is a forward theorem provingmethod for cut-free sequent calculi that relies on the subformula property. The Logic of Bunched Implications (BI), due to Pym and O’Hearn, is a logic which freely combines the familiar connectives of intuitionistic logic with multiplicative linear conjunction and its adjoint implication. We present the first formulation of an inver...
متن کاملA syntactic proof of decidability for the logic of bunched implication BI
The logic of bunched implication BI provides a framework for reasoning about resource composition and forms the basis for an assertion language of separation logic which is used to reason about software programs. Propositional BI is obtained by freely combining propositional intuitionistic logic and multiplicative intuitionistic linear logic. It possesses an elegant proof theory: its bunched ca...
متن کامل